Generating Functions for Products of Recursive Sequences
نویسندگان
چکیده
منابع مشابه
Generating functions for tensor products
This is the first of two articles devoted to a comprehensive exposition of the generating-function method for computing fusion rules in affine Lie algebras. The present paper is entirely devoted to the study of the tensor-product (infinite-level) limit of fusions rules. We consider thus in detail the problem of constructing tensor-product generating functions in finite Lie algebras. From the be...
متن کاملGenerating Sequences of Functions
In 1934 Sierpiński [5] proved that every function from a countable family X of continuous functions f : [0, 1] → [0, 1] can be obtained as a composition of four such functions. These four functions are said to generate the aforementioned family. The sequence X is not necessarily closed under composition, so it may be more precise to say that these four functions generate a semigroup containing ...
متن کاملOn composition of generating functions
In this work we study numbers and polynomials generated by two type of composition of generating functions and get their explicit formulae. Furthermore we state an improvementof the composita formulae's given in [6] and [3], using the new composita formula's we construct a variety of combinatorics identities. This study go alone to dene new family of generalized Bernoulli polynomials which incl...
متن کاملGenerating Functions Involving Arbitrary Products∗
We show that the use of operational methods and of multi-index Bessel functions allow the derivation of generating functions, involving the product of an arbitrary number of Laguerre polynomials. ∗2000 Mathematics Subject Classification. 33C45, 44A45. †E-mail:[email protected] ‡E-mail:[email protected] §E-mail:[email protected] ¶E-mail:[email protected] 270 G. Dattol...
متن کاملNon Recursive Functions Have Transcendental Generating Series
In this note we shaii prove that non primitive recursive functions have transcendental generating series. This resuit translates a certain measure of the complexity of a fonction, the fact of not being primitive recursive, into another measure of the complexity of the generating series associated to the function, the fact of being transcendental. Résumé. On démontre que les fonctions qui ne son...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1965
ISSN: 0002-9947
DOI: 10.2307/1994119